Moments of the Fisher Transform: Applications Using Small Samples
نویسندگان
چکیده
This paper presents a theoretical development that extends results on the distribution of the sample correlation coefficient and the Fisher transform (Fisher, 1921). Several well known correlational procedures use the Fisher transform or its square as the basis of hypothesis testing. These procedures assume that the variance of the Fisher transform can be approximated adequately as 1/( 3) n − . We present results that demonstrate that for small sample size this is not necessarily true. We present results that demonstrate that for small sample size this is not necessarily true. Exact moments of the Fisher transform and its square are computed for both null and non-null correlations for small n ( ≤ 20). An extension of the classic series expansion formulae of Hotelling (Hotelling, 1953) for the moments of the Fisher transform and its square are discussed and compared with the exact moments of the Fisher transform and its square. Monte Carlo experiments are used to demonstrate how these results may produce significant improvements in the small sample performance of tests for pattern hypothesis on correlation matrices.
منابع مشابه
Adaptive Segmentation with Optimal Window Length Scheme using Fractal Dimension and Wavelet Transform
In many signal processing applications, such as EEG analysis, the non-stationary signal is often required to be segmented into small epochs. This is accomplished by drawing the boundaries of signal at time instances where its statistical characteristics, such as amplitude and/or frequency, change. In the proposed method, the original signal is initially decomposed into signals with different fr...
متن کاملSIGNLESS LAPLACIAN SPECTRAL MOMENTS OF GRAPHS AND ORDERING SOME GRAPHS WITH RESPECT TO THEM
Let $G = (V, E)$ be a simple graph. Denote by $D(G)$ the diagonal matrix $diag(d_1,cdots,d_n)$, where $d_i$ is the degree of vertex $i$ and $A(G)$ the adjacency matrix of $G$. The signless Laplacianmatrix of $G$ is $Q(G) = D(G) + A(G)$ and the $k-$th signless Laplacian spectral moment of graph $G$ is defined as $T_k(G)=sum_{i=1}^{n}q_i^{k}$, $kgeqslant 0$, where $q_1$,$q_2$, $cdots$, $q_n$ ...
متن کاملBlock-Based Compressive Sensing Using Soft Thresholding of Adaptive Transform Coefficients
Compressive sampling (CS) is a new technique for simultaneous sampling and compression of signals in which the sampling rate can be very small under certain conditions. Due to the limited number of samples, image reconstruction based on CS samples is a challenging task. Most of the existing CS image reconstruction methods have a high computational complexity as they are applied on the entire im...
متن کاملA Novel Probabilistic Optimal Power Flow Method to Handle Large Fluctuations of Stochastic Variables
The traditional cumulant method (CM) for probabilistic optimal power flow (P-OPF) needs to perform linearization on the Karush–Kuhn–Tucker (KKT) first-order conditions, therefore requiring input variables (wind power or loads) varying within small ranges. To handle large fluctuations resulting from large-scale wind power and loads, a novel P-OPF method is proposed, where the correlations among ...
متن کاملA New Five-Parameter Distribution: Properties and Applications
In this paper, a new five-parameter lifetime and reliability distribution named “the exponentiated Uniform-Pareto distribution (EU-PD),” has been suggested that it has a bathtub-shaped and inverse bathtub-shape for modeling lifetime data. This distribution has applications in economics, actuarial modelling, reliability modeling, lifetime and biological sciences. Firstly, the mathematical and st...
متن کامل